Geometry of Permutation Limits
نویسندگان
چکیده
منابع مشابه
Limits of permutation sequences
A permutation sequence (σn)n∈N is said to be convergent if, for every fixed permutation τ , the density of occurrences of τ in the elements of the sequence converges. We prove that such a convergent sequence has a natural limit object, namely a Lebesgue measurable function Z : [0, 1] → [0, 1] with the additional properties that, for every fixed x ∈ [0, 1], the restriction Z(x, ·) is a cumulativ...
متن کاملGeometry, Complexity, and Combinatorics of Permutation Polytopes
Each group G of permutation matrices gives rise to a permutation polytope P(G) = cony(G) c Re×d, and for any x ~ W, an orbit polytope P(G, x) = conv(G, x). A broad subclass is formed by the Young permutation polytopes, which correspond bijectively to partitions 2 = (21, ..., 2k)~-n of positive integers, and arise from the Young representations of the symmetric group. Young polytopes provide a f...
متن کاملAdiabatic limits and spectral geometry of foliations
Let (M, F) be a closed foliated manifold, dimM = n, dimF = p, p+q = n, equipped with a Riemannian metric gM . We assume that the foliation F is Riemannian, and the metric gM is bundle-like. Let F = TF be the integrable distribution of tangent p-planes to F , and H = F⊥ be the orthogonal complement to F . The decomposition of TM into a direct sum, TM = F ⊕ H , induces a decomposition of the metr...
متن کاملControls and limits on bedrock channel geometry
[1] Data on channel geometry in naturally incising bedrock rivers reveal variable relationships between channel width, slope, and erosion rate. To explain the range of relationships between these parameters, we propose an optimized channel geometry model. The model reproduces previous theoretical and numerical modeling scaling relationships; however, to explain the field data, the model must in...
متن کاملPartial permutation decoding for codes from affine geometry designs
We find explicit PD-sets for partial permutation decoding of the generalized Reed-Muller codes RFp (2(p − 1), 3) from the affine geometry designs AG3,1(Fp) of points and lines in dimension 3 over the prime field of order p, using the information sets found in [8]. Mathematics Subject Classification (2000): 05, 51, 94.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2019
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-019-3817-6